Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar14/TRCSRSLASHEx9_BLR02

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A__ZPRIMES -> A__NATS₁(s₁(s₁(0)))
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X1)
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X3)
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X2)
A__NATS₁(N) -> MARK₁(N)
MARK₁(nats₁(X)) -> A__NATS₁(mark₁(X))
MARK₁(filter₃(X1, X2, X3)) -> A__FILTER₃(mark₁(X1), mark₁(X2), mark₁(X3))
MARK₁(s₁(X)) -> MARK₁(X)
A__ZPRIMES -> A__SIEVE₁(a__nats₁(s₁(s₁(0))))
MARK₁(sieve₁(X)) -> A__SIEVE₁(mark₁(X))
MARK₁(nats₁(X)) -> MARK₁(X)
MARK₁(zprimes) -> A__ZPRIMES
A__SIEVE₁(cons₂(s₁(N), Y)) -> MARK₁(N)
A__FILTER₃(cons₂(X, Y), s₁(N), M) -> MARK₁(X)
MARK₁(cons₂(X1, X2)) -> MARK₁(X1)
MARK₁(sieve₁(X)) -> MARK₁(X)

The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

A__ZPRIMES -> A__NATS₁(s₁(s₁(0)))
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X1)
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X3)
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X2)
A__NATS₁(N) -> MARK₁(N)
MARK₁(nats₁(X)) -> A__NATS₁(mark₁(X))
MARK₁(filter₃(X1, X2, X3)) -> A__FILTER₃(mark₁(X1), mark₁(X2), mark₁(X3))
MARK₁(s₁(X)) -> MARK₁(X)
A__ZPRIMES -> A__SIEVE₁(a__nats₁(s₁(s₁(0))))
MARK₁(sieve₁(X)) -> A__SIEVE₁(mark₁(X))
MARK₁(nats₁(X)) -> MARK₁(X)
MARK₁(zprimes) -> A__ZPRIMES
A__SIEVE₁(cons₂(s₁(N), Y)) -> MARK₁(N)
A__FILTER₃(cons₂(X, Y), s₁(N), M) -> MARK₁(X)
MARK₁(cons₂(X1, X2)) -> MARK₁(X1)
MARK₁(sieve₁(X)) -> MARK₁(X)

The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

A__ZPRIMES -> A__NATS₁(s₁(s₁(0)))
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X1)
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X3)
MARK₁(filter₃(X1, X2, X3)) -> MARK₁(X2)
MARK₁(nats₁(X)) -> A__NATS₁(mark₁(X))
MARK₁(filter₃(X1, X2, X3)) -> A__FILTER₃(mark₁(X1), mark₁(X2), mark₁(X3))
MARK₁(s₁(X)) -> MARK₁(X)
A__ZPRIMES -> A__SIEVE₁(a__nats₁(s₁(s₁(0))))
MARK₁(sieve₁(X)) -> A__SIEVE₁(mark₁(X))
MARK₁(nats₁(X)) -> MARK₁(X)
MARK₁(zprimes) -> A__ZPRIMES
A__SIEVE₁(cons₂(s₁(N), Y)) -> MARK₁(N)
A__FILTER₃(cons₂(X, Y), s₁(N), M) -> MARK₁(X)
MARK₁(cons₂(X1, X2)) -> MARK₁(X1)

The remaining pairs can at least by weakly be oriented.

A__NATS₁(N) -> MARK₁(N)
MARK₁(sieve₁(X)) -> MARK₁(X)

Used ordering: Combined order from the following AFS and order.
A__ZPRIMES = A__ZPRIMES
A__NATS₁(x1) = A__NATS₁(x1)
s₁(x1) = s₁(x1)
0 = 0
MARK₁(x1) = MARK₁(x1)
filter₃(x1, x2, x3) = filter₃(x1, x2, x3)
nats₁(x1) = nats₁(x1)
mark₁(x1) = x1
A__FILTER₃(x1, x2, x3) = x1
A__SIEVE₁(x1) = x1
a__nats₁(x1) = a__nats₁(x1)
sieve₁(x1) = x1
zprimes = zprimes
cons₂(x1, x2) = cons₁(x1)
a__zprimes = a__zprimes
a__filter₃(x1, x2, x3) = a__filter₃(x1, x2, x3)
a__sieve₁(x1) = x1

Lexicographic Path Order [19].
Precedence:

[A_{_ZPRIMES}, zprimes, a_{_zprimes]} > 0 > [nats₁, a_{_nats₁}, cons_1] > [A_{_NATS₁}, MARK_1]
[A_{_ZPRIMES}, zprimes, a_{_zprimes]} > 0 > [nats₁, a_{_nats₁}, cons_1] > s₁
[filter₃, a_{_{filter_3]}} > 0 > [nats₁, a_{_nats₁}, cons_1] > [A_{_NATS₁}, MARK_1]
[filter₃, a_{_{filter_3]}} > 0 > [nats₁, a_{_nats₁}, cons_1] > s₁

The following usable rules [14] were oriented:

a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__nats₁(X) -> nats₁(X)
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
a__zprimes -> zprimes
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__sieve₁(X) -> sieve₁(X)
a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

A__NATS₁(N) -> MARK₁(N)
MARK₁(sieve₁(X)) -> MARK₁(X)

The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK₁(sieve₁(X)) -> MARK₁(X)

The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

MARK₁(sieve₁(X)) -> MARK₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
MARK₁(x1) = MARK₁(x1)
sieve₁(x1) = sieve₁(x1)

Lexicographic Path Order [19].
Precedence:

sieve₁ > MARK₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ QDP

              ↳ QDPOrderProof

                ↳ QDP

                  ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a__filter₃(cons₂(X, Y), 0, M) -> cons₂(0, filter₃(Y, M, M))
a__filter₃(cons₂(X, Y), s₁(N), M) -> cons₂(mark₁(X), filter₃(Y, N, M))
a__sieve₁(cons₂(0, Y)) -> cons₂(0, sieve₁(Y))
a__sieve₁(cons₂(s₁(N), Y)) -> cons₂(s₁(mark₁(N)), sieve₁(filter₃(Y, N, N)))
a__nats₁(N) -> cons₂(mark₁(N), nats₁(s₁(N)))
a__zprimes -> a__sieve₁(a__nats₁(s₁(s₁(0))))
mark₁(filter₃(X1, X2, X3)) -> a__filter₃(mark₁(X1), mark₁(X2), mark₁(X3))
mark₁(sieve₁(X)) -> a__sieve₁(mark₁(X))
mark₁(nats₁(X)) -> a__nats₁(mark₁(X))
mark₁(zprimes) -> a__zprimes
mark₁(cons₂(X1, X2)) -> cons₂(mark₁(X1), X2)
mark₁(0) -> 0
mark₁(s₁(X)) -> s₁(mark₁(X))
a__filter₃(X1, X2, X3) -> filter₃(X1, X2, X3)
a__sieve₁(X) -> sieve₁(X)
a__nats₁(X) -> nats₁(X)
a__zprimes -> zprimes

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.